Performances Analysis of Serial Concatenated codes based on BCH and LDPC Codes using Berlekamp- massey and sum-product algorithms

نویسنده

  • Mohammed Ben Abdellah
چکیده

In this paper, a decoding technique for the concatenated codes based on the Bose-Chaudhuri-Hocquenghem code (BCH) and the low density parity check (LDPC) is proposed. It is based on the berlekamp-massey and sum-product algorithms. The output values delivered by the sum-product algorithm, after a fixed number of iterations, are used as input values to perform Berlekamp-massey decoding. The proposed approach present high performance and reduce the Bit Error Rate (BER). Several examples of simulation are tested by the widely used Additive White Gaussian Noise (AWGN) model and Binary Phase shift Keying (BPSK) modulation. Finally, this solution is validated by the 64x64 grayscale Lena image. The obtained results provide significantly improved system performances in term of Peak Signal to Noise Ratio (PSNR).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decoding Procedure for BCH, Alternant and Goppa Codes defined over Semigroup Ring

In this paper we present a decoding principle for BCH, Alternant and Goppa codes constructed through a semigroup ring, which is based on modified Berlekamp-Massey algorithm. This algorithm corrects all errors up to the Hamming weight t ≤ r, i.e., whose minimum Hamming distance is 2r + 1. Key-word: Semigroup rings, BCH codes, Alternant codes, Goppa codes, modified BerlekampMassey algorithm.

متن کامل

Alternant and BCH codes over certain rings

Alternant codes over arbitrary finite commutative local rings with identity are constructed in terms of parity-check matrices. The derivation is based on the factorization of xs − 1 over the unit group of an appropriate extension of the finite ring. An efficient decoding procedure which makes use of the modified Berlekamp-Massey algorithm to correct errors and erasures is presented. Furthermore...

متن کامل

Least squares based decoding for BCH codes in image applications

BCH codes in the frequency domain provide robust channel coding for image channel coding applications. The underlying problem of estimation of real/complex sinusoids in white additive noise may be formulated and solved in different ways. The standard approach is based on the least squares method and Berlekamp-Massey algorithm (BMA). In this paper we compare the performance of the BMA with other...

متن کامل

Serial Genetic Algorithm Decoder for Low Density Parity Check Codes

Genetic algorithms are successfully used for decoding some classes of error correcting codes, and offer very good performances for solving large optimization problems. This article proposes a new decoder based on Serial Genetic Algorithm Decoder (SGAD) for decoding Low Density Parity Check (LDPC) codes. The results show that the proposed algorithm gives large gains over sum-product decoder, whi...

متن کامل

A Study on VHDL Implementation of a Class of Irregular Structured LDPC Codes applied to 100 Gbps Optical Networks

This paper presents a study on the VHDL implementation of a class of binary irregular structured LDPC codes (IS-LDPC) applied to 100 Gbps optical networks. A comparison between two iterative decoding algorithms for irregular structured LDPC codes, sum-product based on loglikelihood ratio and min-sum, is used to define the best choice for implementation. The performances of IS-LDPC codes are eva...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010